A Strongly Polynomial Simplex Method for Totally Unimodular LP
نویسنده
چکیده
Kitahara and Mizuno get new bounds for the number of distinct solutions generated by the simplex method for linear programming (LP). In this paper, we combine results of Kitahara and Mizuno and Tardos’s strongly polynomial algorithm, and propose an algorithm for solving a standard form LP problem. The algorithm solves polynomial number of artificial LP problems by the simplex method with Dantzig’s rule. It is shown that the total number of distinct basic solutions generated by the algorithm is polynomially bounded in the number of constraints, the number of variables, and the maximum determinant of submatrices of a coefficient matrix. If the coefficient matrix is totally unimodular and all the artificial problems are nondegenerate, then the algorithm is strongly polynomial.
منابع مشابه
A primal-simplex based Tardos' algorithm
In the mid-eighties Tardos proposed a strongly polynomial algorithm for solving linear programming problems for which the size of the coefficient matrix is polynomially bounded in the dimension of the input. Combining Orlin’s primal-basedmodification andMizuno’s use of the simplex method, we introduce a modification of Tardos’ algorithm considering only the primal problem and using the simplex ...
متن کاملCsc5160: Combinatorial Optimization and Approximation Algorithms Topic: Min-max Theorem
In this lecture, we show the applications of the strong duality theorem, and discuss how to obtain min-max theorems and combinatorial algorithms from linear programming. We first introduce the 2 player, zero-sum game and show that this can be solved by minimax theorem and we also prove the minimax theorem by the LP-duality theorem. After that, we introduce some applications of minimax theorem, ...
متن کاملGeometric Random Edge
We show that a variant of the random-edge pivoting rule results in a strongly polynomial time simplex algorithm for linear programs max{cTx : x ∈ R, Ax 6 b}, whose constraint matrix A satisfies a geometric property introduced by Brunsch and Röglin: The sine of the angle of a row of A to a hyperplane spanned by n− 1 other rows of A is at least δ. This property is a geometric generalization of A ...
متن کاملSolving Totally Unimodular LPs with the Shadow Vertex Algorithm
We show that the shadow vertex simplex algorithm can be used to solve linear programs in strongly polynomial time with respect to the number n of variables, the number m of constraints, and 1/δ, where δ is a parameter that measures the flatness of the vertices of the polyhedron. This extends our recent result that the shadow vertex algorithm finds paths of polynomial length (w.r.t. n, m, and 1/...
متن کاملRandom Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm
We discuss the application of random walks to generating a random basis of a totally unimodular matrix and to solving a linear program with such a constraint matrix. We also derive polynomial upper bounds on the combinatorial diameter of an associated polyhedron. •Supported by NATO grant RG0088/89 tSupported by NSF grants CCR-8900112, CCR-9024935 and NATO grant RG0088/89
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014